Void Avoiding Opportunistic Routing Protocols for Underwater Wireless Sensor Networks: A Survey

One of the most challenging issues in the routing protocols for underwater wireless sensor networks (UWSNs) is the occurrence of void areas (communication void). That is, when void areas are present, the data packets could be trapped in a sensor node and cannot be sent further to reach the sink(s) due to the features of the UWSNs environment and/or the configuration of the network itself. Opportunistic routing (OR) is an innovative prototype in routing for UWSNs. In routing protocols employing the OR technique, the most suitable sensor node according to the criteria adopted by the protocol rules will be elected as a next-hop forwarder node to forward the data packets first. This routing method takes advantage of the broadcast nature of wireless sensor networks. OR has made a noticeable improvement in the sensor networks’ performance in terms of efficiency, throughput, and reliability. Several routing protocols that utilize OR in UWSNs have been proposed to extend the lifetime of the network and maintain its connectivity by addressing void areas. In addition, a number of survey papers were presented in routing protocols with different points of approach. Our paper focuses on reviewing void avoiding OR protocols. In this paper, we briefly present the basic concept of OR and its building blocks. We also indicate the concept of the void area and list the reasons that could lead to its occurrence, as well as reviewing the state-of-the-art OR protocols proposed for this challenging area and presenting their strengths and weaknesses

Void Avoidance Opportunistic Routing Protocol for Underwater Wireless Sensor Networks

Much attention has been focused lately on the Opportunistic Routing technique (OR) that can overcome the restrictions of the harsh underwater environment and the unique structures of the Underwater Sensor Networks (UWSNs). OR enhances the performance of the UWSNs in both packet delivery ratio and energy saving. In our work; we propose a new routing protocol; called Energy Efficient Depth-based Opportunistic Routing with Void Avoidance for UWSNs (EEDOR-VA), to address the void area problem. EEDOR-VA is a reactive OR protocol that uses a hop count discovery procedure to update the hop count of the intermediate nodes between the source and the destination to form forwarding sets. EEDOR-VA forwarding sets can be selected with less or greater depth than the packet holder (i.e., source or intermediate node). It efficiently prevents all void/trapped nodes from being part of the forwarding sets and data transmission procedure; thereby saving network resources and delivering data packets at the lowest possible cost. The results of our extensive simulation study indicate that the EEDOR-VA protocol outperforms other protocols in terms of packet delivery ratio and energy consumption

Security Hardening of Botnet Detectors Using Generative Adversarial Networks

Machine learning (ML) based botnet detectors are no exception to traditional ML models when it comes to adversarial evasion attacks. The datasets used to train these models have also scarcity and imbalance issues. We propose a new technique named Botshot , based on generative adversarial networks (GANs) for addressing these issues and proactively making botnet detectors aware of adversarial evasions. Botshot is cost-effective as compared to the network emulation for botnet traffic data generation rendering the dedicated hardware resources unnecessary. First, we use the extended set of network flow and time-based features for three publicly available botnet datasets. Second, we utilize two GANs (vanilla, conditional) for generating realistic botnet traffic. We evaluate the generator performance using classifier two-sample test (C2ST) with 10-fold 70-30 train-test split and propose the use of ’recall’ in contrast to ’accuracy’ for proactively learning adversarial evasions. We then augment the train set with the generated data and test using the unchanged test set. Last, we compare our results with benchmark oversampling methods with augmentation of additional botnet traffic data in terms of average accuracy, precision, recall and F1 score over six different ML classifiers. The empirical results demonstrate the effectiveness of the GAN-based oversampling for learning in advance the adversarial evasion attacks on botnet detectors

Guidelines for implementation of cystic fibrosis newborn screening programs: Cystic Fibrosis Foundation workshop report

Newborn screening for cystic fibrosis offers the opportunity for early intervention and improved outcomes. This summary, resulting from a workshop sponsored by the Cystic Fibrosis Foundation to facilitate implementation of widespread high quality cystic fibrosis newborn screening, outlines the steps necessary for success based on the experience of existing programs. Planning should begin with a workgroup composed of those who will be responsible for the success of the local program, typically including the state newborn screening program director and cystic fibrosis care center directors. The workgroup must develop a screening algorithm based on program resources and goals including mechanisms available for sample collection, regional demographics, the spectrum of cystic fibrosis disease to be detected, and acceptable failure rates of the screen. The workgroup must also ensure that all necessary guidelines and resources for screening, diagnosis, and care be in place prior to cystic fibrosis newborn screening implementation. These include educational materials for parents and primary care providers; systems for screening and for providing diagnostic testing and counseling for screen-positive infants and their families; and protocols for care of this unique population. This summary explores the benefits and risks of various screening algorithms, including complex situations that can occur involving unclear diagnostic results, and provides guidelines and sample materials for state newborn screening programs to develop and implement high quality screening for cystic fibrosis

SH3 Domain-Peptide Binding Energy Calculations Based on Structural Ensemble and Multiple Peptide Templates

SH3 domains mediate signal transduction by recognizing short peptides. Understanding of the driving forces in peptide recognitions will help us to predict the binding specificity of the domain-peptide recognition and to understand the molecular interaction networks of cells. However, accurate calculation of the binding energy is a tough challenge. In this study, we propose three ideas for improving our ability to predict the binding energy between SH3 domains and peptides: (1) utilizing the structural ensembles sampled from a molecular dynamics simulation trajectory, (2) utilizing multiple peptide templates, and (3) optimizing the sequence-structure mapping. We tested these three ideas on ten previously studied SH3 domains for which SPOT analysis data were available. The results indicate that calculating binding energy using the structural ensemble was most effective, clearly increasing the prediction accuracy, while the second and third ideas tended to give better binding energy predictions. We applied our method to the five SH3 targets in DREAM4 Challenge and selected the best performing method

The Science Performance of JWST as Characterized in Commissioning

This paper characterizes the actual science performance of the James Webb Space Telescope (JWST), as determined from the six month commissioning period. We summarize the performance of the spacecraft, telescope, science instruments, and ground system, with an emphasis on differences from pre-launch expectations. Commissioning has made clear that JWST is fully capable of achieving the discoveries for which it was built. Moreover, almost across the board, the science performance of JWST is better than expected; in most cases, JWST will go deeper faster than expected. The telescope and instrument suite have demonstrated the sensitivity, stability, image quality, and spectral range that are necessary to transform our understanding of the cosmos through observations spanning from near-earth asteroids to the most distant galaxies.Comment: 5th version as accepted to PASP; 31 pages, 18 figures; https://iopscience.iop.org/article/10.1088/1538-3873/acb29

The James Webb Space Telescope Mission

Twenty-six years ago a small committee report, building on earlier studies, expounded a compelling and poetic vision for the future of astronomy, calling for an infrared-optimized space telescope with an aperture of at least $4m$. With the support of their governments in the US, Europe, and Canada, 20,000 people realized that vision as the $6.5m$ James Webb Space Telescope. A generation of astronomers will celebrate their accomplishments for the life of the mission, potentially as long as 20 years, and beyond. This report and the scientific discoveries that follow are extended thank-you notes to the 20,000 team members. The telescope is working perfectly, with much better image quality than expected. In this and accompanying papers, we give a brief history, describe the observatory, outline its objectives and current observing program, and discuss the inventions and people who made it possible. We cite detailed reports on the design and the measured performance on orbit.Comment: Accepted by PASP for the special issue on The James Webb Space Telescope Overview, 29 pages, 4 figure

An energy efficient fuzzy logic cluster formation protocol in wireless sensor networks

Despite significant advancements in wireless sensor networks (WSNs), energy conservation remains one of the most important research challenges. Researchers have investigated architectures and topologies that allow energy efficient operation of WSNs. One of the popular techniques in this regard is clustering. While many researchers have investigated cluster head selection, this paper investigates the cluster formation. In particular, we propose a novel scheme, the Fuzzy Logic Cluster Formation Protocol (FLCFP), which uses Fuzzy Logic Inference System (FIS) in the cluster formation process. We demonstrate that using multiple parameters in cluster formation reduces energy consumption. We compare our technique with the well known LEACH protocol to show that using a multi parameter FIS enhances the network lifetime significantly

Swarm Intelligence Optimization Techniques for Obstacle-Avoidance Mobility-Assisted Localization in Wireless Sensor Networks

In many applications of wireless sensor networks (WSNs), node location is required to locate the monitored event once occurs. Mobility-Assisted Localization has emerged as an efficient technique for node localization. It works on optimizing a path planning of a location-aware mobile node, called mobile anchor (MA). The task of the MA is to traverse the area of interest (network) in a way that minimizes the localization error while maximizing the num- ber of successful localized nodes. For simplicity, many path planning models assume that the MA has a sufficient source of energy and time, and the network area is obstacle-free. However, in many real-life applications such assumptions are rare. When the network area includes many obstacles, which need to be avoided, and the MA itself has a limited movement distance that cannot be exceeded, a dynamic movement approach is needed. In this paper, we propose two novel dynamic movement techniques that offer obstacle-avoidance path planning for mobility-assisted localization in WSNs. The movement planning is designed in a real-time using two swarm intelligence based algorithms, namely Grey Wolf Optimizer (GWO) and Whale Optimization Algorithm (WOA). Both of our proposed models, Grey Wolf optimizer based Path Planning (GWPP) and Whale Optimization algorithm based Path Planning (WOPP), provide superior outcomes in comparison to other existing works in several metrics including both localization ratio and localization error rate